import java.util.Scanner;

public class Main {

    //肖恩的 n 次根
    public static double a;
    public static int b;
    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        a = scan.nextDouble();
        b = scan.nextInt();
        double l = 0;
        double r = a;
        while((r - l) > 1e-4){
            double mid = (l + r) / 2;
            if(func(mid) < a){
                l = mid;
            }else{
                r = mid;
            }
        }
        System.out.println((int) l * 1000);
    }

    private static double func(double mid){
        double res = 1;
        for (int i = 1; i <= b; i++) {
            res *= mid;
        }
        return res;
    }

}
